MINIMALISASI BIAYA SIMPAN DAN BIAYA SETUP PADA MULTIPLE PRODUK: SIMULASI DENGAN CAPACITATED LOT SIZING PROBLEM
نویسندگان
چکیده
منابع مشابه
A Capacitated Lot Sizing Problem with Stochastic Setup Times
In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...
متن کاملAn MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
This paper considers the capacitated multi-level lot-sizing problem with setup times, a class of difficult problems often faced in practical production planning settings. In the literature, relax-and-fix is a technique commonly applied to solve this problem due to the fact that setup decisions in later periods of the planning horizon are sensitive to setup decisions in the early periods but not...
متن کاملMIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition s...
متن کاملThe multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but can be totally or partially lost. The problem is NP-hard. A mixed integer mathematical formulation is presented. Our approach in this paper is to propose some classes of valid inequalities based on a generalization of...
متن کاملA Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
We introduce Horizon Decomposition in the context of Dantzig-Wolfe Decomposition, and apply it to the Capacitated Lot-Sizing Problem with Setup Times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Riset Manajemen dan Bisnis (JRMB) Fakultas Ekonomi UNIAT
سال: 2019
ISSN: 2581-2165,2527-7502
DOI: 10.36226/jrmb.v4i2.260